#include "Sort.h"

int main()
{
	int a[] = { 9,1,2,5,7,4,6,3 };
	//InsertSort(a, 10);
	int n = sizeof(a) / sizeof(a[0]);
	//BubbleSort(a, n);
	//HeapSort(a, n);
	//ShellSort(a, n);
	//SelectSort(a, n);
	//QuickSort(a, 0, n - 1);
	//QuickSortNonR(a, 0, n - 1);
	//MergeSort(a, n);
	//MergeSortNonR(a, n);
	CountSort(a, n);
	PrintArray(a, n);
	return 0;
}